منابع مشابه
Not So Many Runs in Strings
Since the work of Kolpakov and Kucherov in [5, 6], it is known that ρ(n), the maximal number of runs in a string, is linear in the length n of the string. A lower bound of 3/(1 + √ 5)n ∼ 0.927n has been given by Franek and al. [3, 4], and upper bounds have been recently provided by Rytter, Puglisi and al., and Crochemore and Ilie (1.6n) [8, 7, 1]. However, very few properties are known for the ...
متن کاملSo Many users - So Many Perspectives
Visualization — the transformation of data and information into multimedia including pictures, animation and 3D scenes — enables users to understand information more naturally. It reveals patterns and relations in the information which may otherwise remain hidden. As a consequence, it can provide a single user with enough valuable information to support decision making. In addition to this, vis...
متن کاملA non-classical unital of order four with many translations
We give a general construction for unitals of order q admitting an action of SU(2, q). The construction covers the classical hermitian unitals, Grüning’s unitals in Hall planes and at least one unital of order four where the translation centers fill precisely one block. For the latter unital, we determine the full group of automorphisms and show that there are no group-preserving embeddings int...
متن کاملNot so Non-renormalizable Gravity
We review recent progress with the understanding of quantum fields, including ideas [1] how gravity might turn out to be a renormalizable theory after all.
متن کاملNon-separating subgraphs after deleting many disjoint paths
Motivated by the well-known conjecture by Lovász [6] on the connectivity after the path removal, we study the following problem: There exists a function f = f(k, l) such that the following holds. For every f(k, l)connected graph G and two distinct vertices s and t in G, there are k internally disjoint paths P1, . . . , Pk with endpoints s and t such that G− ⋃k i=1 V (Pi) is l-connected. When k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society, Series B
سال: 2018
ISSN: 2330-1511
DOI: 10.1090/bproc/39